\section{Automaton}

In this chapter we will show several different models of automata which can
accept two-dimensional languages. Some of these models are working similarly to
those in the one-dimensional case. Other models like the matrix automata are
only defined for the picture languages. In the following $L(M)$ describes the
language of all pictures $p$ that are accepted by an automaton $M$.

\subsection{Finite Automata}
\input{automata/finite_automata.tex}
\subsection{On-line Tessellation Automata}
\input{automata/on-line_tesselation_automata.tex}
\subsection{Marker Automata}
\input{automata/marker_automata.tex}
\subsection{Matrix Automata}
\input{automata/matrix_automata.tex}
\subsection{Sgraffito Automata}
\input{automata/sgraffito_automata.tex}
%\subsection{Two way two tape automata}
%\input{automata/two_way_two_tape_automata.tex}